Super Paramagnetic Clustering of DNA Sequences
نویسندگان
چکیده
منابع مشابه
Super Paramagnetic Clustering of Data (spc)
1 Summary A new clustering algorithm named Super Paramagnetic Clustering (SPC) which was published by Blatt et al. 1]]2]]3] is described. The algorithm, which was rst motivated by properties of inhomogeneous magnets, is described as an outcome of a general technique to create robust clustering algorithms. The technique uses a clustering cost function and nds the average custering solution at di...
متن کاملSuper paramagnetic clustering of yeast gene expression pro les
High density DNA arrays used to monitor gene expression at a genomic scale have produced vast amounts of information which require the development of e cient computational methods to analyze them The important rst step is to extract the fundamental patterns of gene expression inherent in the data This paper de scribes the application of a novel clustering algorithm Super Paramagnetic Cluster in...
متن کاملSuper-paramagnetic clustering of yeast gene expression profiles
High-density DNA arrays, used to monitor gene expression at a genomic scale, have produced vast amounts of information which require the development of efficient computational methods to analyze them. The important first step is to extract the fundamental patterns of gene expression inherent in the data. This paper describes the application of a novel clustering algorithm, Super-Paramagnetic Cl...
متن کاملClustering of DNA sequences in human promoters.
We have determined the distribution of each of the 65,536 DNA sequences that are eight bases long (8-mer) in a set of 13,010 human genomic promoter sequences aligned relative to the putative transcription start site (TSS). A limited number of 8-mers have peaks in their distribution (cluster), and most cluster within 100 bp of the TSS. The 156 DNA sequences exhibiting the greatest statistically ...
متن کاملClustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biological Physics
سال: 2006
ISSN: 0092-0606,1573-0689
DOI: 10.1007/s10867-006-2120-0